Implementations of Term Rewriting Systems
نویسندگان
چکیده
منابع مشابه
Sharing Implementations of Graph Rewriting Systems
Sharing graphs are a brilliant solution to the implementation of Lévy optimal reductions of λ-calculus. Sharing graphs are interesting on their own and optimal sharing reductions are just a particular reduction strategy of a more general sharing reduction system. The paper is a gentle introduction to sharing graphs and tries to confute some of the common myths on the difficulty of sharing imple...
متن کاملOrderal Term Rewriting Systems
This article describes a generalization of term rewriting system technique used as a basis for decision algorithm for equational theories. The or-deral term rewriting system technique is presented. The main innovation of the proposed technique is that reductions according to some rules of such a system are performed only if special restrictions are satissed. The restrictions are based on term o...
متن کاملExtended Term Rewriting Systems
In this paper we will consider some extensions of the usual term rewrite format, namely: term rewriting with conditions, infmi~y term rewriting and term rewriting with bound variables. Rather than aiming at a complete survey, we discuss some aspects of these three extensions.
متن کاملLearning Term Rewriting Systems
Learning from entailment is a learning model suitable for learning rst-order formulas, in which examples are formulas in the rst-order language which are implied or not implied. In this paper, we study the learnability of term rewriting systems in this framework. A term rewriting system is a simple model of tree transduction used for semi-structured data and Web, which can be considered as a fr...
متن کاملTransfinite Rewriting Semantics for Term Rewriting Systems
We provide some new results concerning the use of trans-nite rewriting for giving semantics to rewrite systems. We especially (but not only) consider the computation of possibly innnite constructor terms by transsnite rewriting due to their interest in many programming languages. We reconsider the problem of compressing transsnite rewrite sequences into shorter (possibly nite) ones. We also inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1991
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/34.1.20